The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(and(tt, X)) → mark(X)
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(s(length(L)))
active(take(0, IL)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(cons(N, take(M, IL)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(and(X1, X2)) → and(active(X1), X2)
active(length(X)) → length(active(X))
active(s(X)) → s(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
length(mark(X)) → mark(length(X))
s(mark(X)) → mark(s(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(s(X)) → s(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
length(ok(X)) → ok(length(X))
s(ok(X)) → ok(s(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Rewrite Strategy: FULL

(1) DecreasingLoopProof (EQUIVALENT transformation)

The following loop(s) give(s) rise to the lower bound Ω(n¹):
The rewrite sequence
cons(mark(X1), X2) →⁺ mark(cons(X1, X2))
gives rise to a decreasing loop by considering the right hand sides subterm at position [0].
The pumping substitution is [X1 / mark(X1)].
The result substitution is [ ].

(2) BOUNDS(n^1, INF)

(3) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(4) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

active(zeros) → mark(cons(0', zeros))
active(and(tt, X)) → mark(X)
active(length(nil)) → mark(0')
active(length(cons(N, L))) → mark(s(length(L)))
active(take(0', IL)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(cons(N, take(M, IL)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(and(X1, X2)) → and(active(X1), X2)
active(length(X)) → length(active(X))
active(s(X)) → s(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
length(mark(X)) → mark(length(X))
s(mark(X)) → mark(s(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0') → ok(0')
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(s(X)) → s(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
length(ok(X)) → ok(length(X))
s(ok(X)) → ok(s(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

S is empty.
Rewrite Strategy: FULL

(5) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(6) Obligation:

TRS:
Rules:
active(zeros) → mark(cons(0', zeros))
active(and(tt, X)) → mark(X)
active(length(nil)) → mark(0')
active(length(cons(N, L))) → mark(s(length(L)))
active(take(0', IL)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(cons(N, take(M, IL)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(and(X1, X2)) → and(active(X1), X2)
active(length(X)) → length(active(X))
active(s(X)) → s(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
length(mark(X)) → mark(length(X))
s(mark(X)) → mark(s(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0') → ok(0')
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(s(X)) → s(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
length(ok(X)) → ok(length(X))
s(ok(X)) → ok(s(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Types:
active :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
zeros :: zeros:0':mark:tt:nil:ok
mark :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
cons :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
0' :: zeros:0':mark:tt:nil:ok
and :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
tt :: zeros:0':mark:tt:nil:ok
length :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
nil :: zeros:0':mark:tt:nil:ok
s :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
take :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
proper :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
ok :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
top :: zeros:0':mark:tt:nil:ok → top
hole_zeros:0':mark:tt:nil:ok1_0 :: zeros:0':mark:tt:nil:ok
hole_top2_0 :: top
gen_zeros:0':mark:tt:nil:ok3_0 :: Nat → zeros:0':mark:tt:nil:ok

(7) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
active, cons, s, length, take, and, proper, top

They will be analysed ascendingly in the following order:
cons < active
s < active
length < active
take < active
and < active
active < top
cons < proper
s < proper
length < proper
take < proper
and < proper
proper < top

(8) Obligation:

TRS:
Rules:
active(zeros) → mark(cons(0', zeros))
active(and(tt, X)) → mark(X)
active(length(nil)) → mark(0')
active(length(cons(N, L))) → mark(s(length(L)))
active(take(0', IL)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(cons(N, take(M, IL)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(and(X1, X2)) → and(active(X1), X2)
active(length(X)) → length(active(X))
active(s(X)) → s(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
length(mark(X)) → mark(length(X))
s(mark(X)) → mark(s(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0') → ok(0')
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(s(X)) → s(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
length(ok(X)) → ok(length(X))
s(ok(X)) → ok(s(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Types:
active :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
zeros :: zeros:0':mark:tt:nil:ok
mark :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
cons :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
0' :: zeros:0':mark:tt:nil:ok
and :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
tt :: zeros:0':mark:tt:nil:ok
length :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
nil :: zeros:0':mark:tt:nil:ok
s :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
take :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
proper :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
ok :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
top :: zeros:0':mark:tt:nil:ok → top
hole_zeros:0':mark:tt:nil:ok1_0 :: zeros:0':mark:tt:nil:ok
hole_top2_0 :: top
gen_zeros:0':mark:tt:nil:ok3_0 :: Nat → zeros:0':mark:tt:nil:ok

Generator Equations:
gen_zeros:0':mark:tt:nil:ok3_0(0) ⇔ zeros
gen_zeros:0':mark:tt:nil:ok3_0(+(x, 1)) ⇔ mark(gen_zeros:0':mark:tt:nil:ok3_0(x))

The following defined symbols remain to be analysed:
cons, active, s, length, take, and, proper, top

They will be analysed ascendingly in the following order:
cons < active
s < active
length < active
take < active
and < active
active < top
cons < proper
s < proper
length < proper
take < proper
and < proper
proper < top

(9) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol cons.

(10) Obligation:

TRS:
Rules:
active(zeros) → mark(cons(0', zeros))
active(and(tt, X)) → mark(X)
active(length(nil)) → mark(0')
active(length(cons(N, L))) → mark(s(length(L)))
active(take(0', IL)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(cons(N, take(M, IL)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(and(X1, X2)) → and(active(X1), X2)
active(length(X)) → length(active(X))
active(s(X)) → s(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
length(mark(X)) → mark(length(X))
s(mark(X)) → mark(s(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0') → ok(0')
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(s(X)) → s(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
length(ok(X)) → ok(length(X))
s(ok(X)) → ok(s(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Types:
active :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
zeros :: zeros:0':mark:tt:nil:ok
mark :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
cons :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
0' :: zeros:0':mark:tt:nil:ok
and :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
tt :: zeros:0':mark:tt:nil:ok
length :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
nil :: zeros:0':mark:tt:nil:ok
s :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
take :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
proper :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
ok :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
top :: zeros:0':mark:tt:nil:ok → top
hole_zeros:0':mark:tt:nil:ok1_0 :: zeros:0':mark:tt:nil:ok
hole_top2_0 :: top
gen_zeros:0':mark:tt:nil:ok3_0 :: Nat → zeros:0':mark:tt:nil:ok

Generator Equations:
gen_zeros:0':mark:tt:nil:ok3_0(0) ⇔ zeros
gen_zeros:0':mark:tt:nil:ok3_0(+(x, 1)) ⇔ mark(gen_zeros:0':mark:tt:nil:ok3_0(x))

The following defined symbols remain to be analysed:
s, active, length, take, and, proper, top

They will be analysed ascendingly in the following order:
s < active
length < active
take < active
and < active
active < top
s < proper
length < proper
take < proper
and < proper
proper < top

(11) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol s.

(12) Obligation:

TRS:
Rules:
active(zeros) → mark(cons(0', zeros))
active(and(tt, X)) → mark(X)
active(length(nil)) → mark(0')
active(length(cons(N, L))) → mark(s(length(L)))
active(take(0', IL)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(cons(N, take(M, IL)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(and(X1, X2)) → and(active(X1), X2)
active(length(X)) → length(active(X))
active(s(X)) → s(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
length(mark(X)) → mark(length(X))
s(mark(X)) → mark(s(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0') → ok(0')
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(s(X)) → s(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
length(ok(X)) → ok(length(X))
s(ok(X)) → ok(s(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Types:
active :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
zeros :: zeros:0':mark:tt:nil:ok
mark :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
cons :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
0' :: zeros:0':mark:tt:nil:ok
and :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
tt :: zeros:0':mark:tt:nil:ok
length :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
nil :: zeros:0':mark:tt:nil:ok
s :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
take :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
proper :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
ok :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
top :: zeros:0':mark:tt:nil:ok → top
hole_zeros:0':mark:tt:nil:ok1_0 :: zeros:0':mark:tt:nil:ok
hole_top2_0 :: top
gen_zeros:0':mark:tt:nil:ok3_0 :: Nat → zeros:0':mark:tt:nil:ok

Generator Equations:
gen_zeros:0':mark:tt:nil:ok3_0(0) ⇔ zeros
gen_zeros:0':mark:tt:nil:ok3_0(+(x, 1)) ⇔ mark(gen_zeros:0':mark:tt:nil:ok3_0(x))

The following defined symbols remain to be analysed:
length, active, take, and, proper, top

They will be analysed ascendingly in the following order:
length < active
take < active
and < active
active < top
length < proper
take < proper
and < proper
proper < top

(13) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol length.

(14) Obligation:

TRS:
Rules:
active(zeros) → mark(cons(0', zeros))
active(and(tt, X)) → mark(X)
active(length(nil)) → mark(0')
active(length(cons(N, L))) → mark(s(length(L)))
active(take(0', IL)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(cons(N, take(M, IL)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(and(X1, X2)) → and(active(X1), X2)
active(length(X)) → length(active(X))
active(s(X)) → s(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
length(mark(X)) → mark(length(X))
s(mark(X)) → mark(s(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0') → ok(0')
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(s(X)) → s(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
length(ok(X)) → ok(length(X))
s(ok(X)) → ok(s(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Types:
active :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
zeros :: zeros:0':mark:tt:nil:ok
mark :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
cons :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
0' :: zeros:0':mark:tt:nil:ok
and :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
tt :: zeros:0':mark:tt:nil:ok
length :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
nil :: zeros:0':mark:tt:nil:ok
s :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
take :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
proper :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
ok :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
top :: zeros:0':mark:tt:nil:ok → top
hole_zeros:0':mark:tt:nil:ok1_0 :: zeros:0':mark:tt:nil:ok
hole_top2_0 :: top
gen_zeros:0':mark:tt:nil:ok3_0 :: Nat → zeros:0':mark:tt:nil:ok

Generator Equations:
gen_zeros:0':mark:tt:nil:ok3_0(0) ⇔ zeros
gen_zeros:0':mark:tt:nil:ok3_0(+(x, 1)) ⇔ mark(gen_zeros:0':mark:tt:nil:ok3_0(x))

The following defined symbols remain to be analysed:
take, active, and, proper, top

They will be analysed ascendingly in the following order:
take < active
and < active
active < top
take < proper
and < proper
proper < top

(15) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol take.

(16) Obligation:

TRS:
Rules:
active(zeros) → mark(cons(0', zeros))
active(and(tt, X)) → mark(X)
active(length(nil)) → mark(0')
active(length(cons(N, L))) → mark(s(length(L)))
active(take(0', IL)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(cons(N, take(M, IL)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(and(X1, X2)) → and(active(X1), X2)
active(length(X)) → length(active(X))
active(s(X)) → s(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
length(mark(X)) → mark(length(X))
s(mark(X)) → mark(s(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0') → ok(0')
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(s(X)) → s(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
length(ok(X)) → ok(length(X))
s(ok(X)) → ok(s(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Types:
active :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
zeros :: zeros:0':mark:tt:nil:ok
mark :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
cons :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
0' :: zeros:0':mark:tt:nil:ok
and :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
tt :: zeros:0':mark:tt:nil:ok
length :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
nil :: zeros:0':mark:tt:nil:ok
s :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
take :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
proper :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
ok :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
top :: zeros:0':mark:tt:nil:ok → top
hole_zeros:0':mark:tt:nil:ok1_0 :: zeros:0':mark:tt:nil:ok
hole_top2_0 :: top
gen_zeros:0':mark:tt:nil:ok3_0 :: Nat → zeros:0':mark:tt:nil:ok

Generator Equations:
gen_zeros:0':mark:tt:nil:ok3_0(0) ⇔ zeros
gen_zeros:0':mark:tt:nil:ok3_0(+(x, 1)) ⇔ mark(gen_zeros:0':mark:tt:nil:ok3_0(x))

The following defined symbols remain to be analysed:
and, active, proper, top

They will be analysed ascendingly in the following order:
and < active
active < top
and < proper
proper < top

(17) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol and.

(18) Obligation:

TRS:
Rules:
active(zeros) → mark(cons(0', zeros))
active(and(tt, X)) → mark(X)
active(length(nil)) → mark(0')
active(length(cons(N, L))) → mark(s(length(L)))
active(take(0', IL)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(cons(N, take(M, IL)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(and(X1, X2)) → and(active(X1), X2)
active(length(X)) → length(active(X))
active(s(X)) → s(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
length(mark(X)) → mark(length(X))
s(mark(X)) → mark(s(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0') → ok(0')
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(s(X)) → s(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
length(ok(X)) → ok(length(X))
s(ok(X)) → ok(s(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Types:
active :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
zeros :: zeros:0':mark:tt:nil:ok
mark :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
cons :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
0' :: zeros:0':mark:tt:nil:ok
and :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
tt :: zeros:0':mark:tt:nil:ok
length :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
nil :: zeros:0':mark:tt:nil:ok
s :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
take :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
proper :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
ok :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
top :: zeros:0':mark:tt:nil:ok → top
hole_zeros:0':mark:tt:nil:ok1_0 :: zeros:0':mark:tt:nil:ok
hole_top2_0 :: top
gen_zeros:0':mark:tt:nil:ok3_0 :: Nat → zeros:0':mark:tt:nil:ok

Generator Equations:
gen_zeros:0':mark:tt:nil:ok3_0(0) ⇔ zeros
gen_zeros:0':mark:tt:nil:ok3_0(+(x, 1)) ⇔ mark(gen_zeros:0':mark:tt:nil:ok3_0(x))

The following defined symbols remain to be analysed:
active, proper, top

They will be analysed ascendingly in the following order:
active < top
proper < top

(19) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol active.

(20) Obligation:

TRS:
Rules:
active(zeros) → mark(cons(0', zeros))
active(and(tt, X)) → mark(X)
active(length(nil)) → mark(0')
active(length(cons(N, L))) → mark(s(length(L)))
active(take(0', IL)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(cons(N, take(M, IL)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(and(X1, X2)) → and(active(X1), X2)
active(length(X)) → length(active(X))
active(s(X)) → s(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
length(mark(X)) → mark(length(X))
s(mark(X)) → mark(s(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0') → ok(0')
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(s(X)) → s(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
length(ok(X)) → ok(length(X))
s(ok(X)) → ok(s(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Types:
active :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
zeros :: zeros:0':mark:tt:nil:ok
mark :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
cons :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
0' :: zeros:0':mark:tt:nil:ok
and :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
tt :: zeros:0':mark:tt:nil:ok
length :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
nil :: zeros:0':mark:tt:nil:ok
s :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
take :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
proper :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
ok :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
top :: zeros:0':mark:tt:nil:ok → top
hole_zeros:0':mark:tt:nil:ok1_0 :: zeros:0':mark:tt:nil:ok
hole_top2_0 :: top
gen_zeros:0':mark:tt:nil:ok3_0 :: Nat → zeros:0':mark:tt:nil:ok

Generator Equations:
gen_zeros:0':mark:tt:nil:ok3_0(0) ⇔ zeros
gen_zeros:0':mark:tt:nil:ok3_0(+(x, 1)) ⇔ mark(gen_zeros:0':mark:tt:nil:ok3_0(x))

The following defined symbols remain to be analysed:
proper, top

They will be analysed ascendingly in the following order:
proper < top

(21) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol proper.

(22) Obligation:

TRS:
Rules:
active(zeros) → mark(cons(0', zeros))
active(and(tt, X)) → mark(X)
active(length(nil)) → mark(0')
active(length(cons(N, L))) → mark(s(length(L)))
active(take(0', IL)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(cons(N, take(M, IL)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(and(X1, X2)) → and(active(X1), X2)
active(length(X)) → length(active(X))
active(s(X)) → s(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
length(mark(X)) → mark(length(X))
s(mark(X)) → mark(s(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0') → ok(0')
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(s(X)) → s(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
length(ok(X)) → ok(length(X))
s(ok(X)) → ok(s(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Types:
active :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
zeros :: zeros:0':mark:tt:nil:ok
mark :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
cons :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
0' :: zeros:0':mark:tt:nil:ok
and :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
tt :: zeros:0':mark:tt:nil:ok
length :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
nil :: zeros:0':mark:tt:nil:ok
s :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
take :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
proper :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
ok :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
top :: zeros:0':mark:tt:nil:ok → top
hole_zeros:0':mark:tt:nil:ok1_0 :: zeros:0':mark:tt:nil:ok
hole_top2_0 :: top
gen_zeros:0':mark:tt:nil:ok3_0 :: Nat → zeros:0':mark:tt:nil:ok

Generator Equations:
gen_zeros:0':mark:tt:nil:ok3_0(0) ⇔ zeros
gen_zeros:0':mark:tt:nil:ok3_0(+(x, 1)) ⇔ mark(gen_zeros:0':mark:tt:nil:ok3_0(x))

The following defined symbols remain to be analysed:
top

(23) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol top.

(24) Obligation:

TRS:
Rules:
active(zeros) → mark(cons(0', zeros))
active(and(tt, X)) → mark(X)
active(length(nil)) → mark(0')
active(length(cons(N, L))) → mark(s(length(L)))
active(take(0', IL)) → mark(nil)
active(take(s(M), cons(N, IL))) → mark(cons(N, take(M, IL)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(and(X1, X2)) → and(active(X1), X2)
active(length(X)) → length(active(X))
active(s(X)) → s(active(X))
active(take(X1, X2)) → take(active(X1), X2)
active(take(X1, X2)) → take(X1, active(X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
length(mark(X)) → mark(length(X))
s(mark(X)) → mark(s(X))
take(mark(X1), X2) → mark(take(X1, X2))
take(X1, mark(X2)) → mark(take(X1, X2))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0') → ok(0')
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(s(X)) → s(proper(X))
proper(take(X1, X2)) → take(proper(X1), proper(X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
length(ok(X)) → ok(length(X))
s(ok(X)) → ok(s(X))
take(ok(X1), ok(X2)) → ok(take(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Types:
active :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
zeros :: zeros:0':mark:tt:nil:ok
mark :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
cons :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
0' :: zeros:0':mark:tt:nil:ok
and :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
tt :: zeros:0':mark:tt:nil:ok
length :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
nil :: zeros:0':mark:tt:nil:ok
s :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
take :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
proper :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
ok :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
top :: zeros:0':mark:tt:nil:ok → top
hole_zeros:0':mark:tt:nil:ok1_0 :: zeros:0':mark:tt:nil:ok
hole_top2_0 :: top
gen_zeros:0':mark:tt:nil:ok3_0 :: Nat → zeros:0':mark:tt:nil:ok

Generator Equations:
gen_zeros:0':mark:tt:nil:ok3_0(0) ⇔ zeros
gen_zeros:0':mark:tt:nil:ok3_0(+(x, 1)) ⇔ mark(gen_zeros:0':mark:tt:nil:ok3_0(x))

No more defined symbols left to analyse.